Noninvadability implies noncoexistence for a class of cancellative systems ∗

نویسنده

  • Jan M. Swart
چکیده

There exist a number of results proving that for certain classes of interacting particle systems in population genetics, mutual invadability of types implies coexistence. In this paper we prove a sort of converse statement for a class of one-dimensional cancellative systems that are used to model balancing selection. We say that a model exhibits strong interface tightness if started from a configuration where to the left of the origin all sites are of one type and to the right of the origin all sites are of the other type, the configuration as seen from the interface has an invariant law in which the number of sites where both types meet has finite expectation. We prove that this implies noncoexistence, i.e., all invariant laws of the process are concentrated on the constant configurations. The proof is based on special relations between dual and interface models that hold for a large class of one-dimensional cancellative systems and that are proved here for the first time.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Cancellative Set Families

A family of subsets of an n-set is 2-cancellative if for every four-tuple {A, B, C, D} of its members A ∪B ∪C = A ∪B ∪D implies C = D. This generalizes the concept of cancellative set families, defined by the property that A ∪B 6= A ∪C for A, B, C all different. The asymptotics of the maximum size of cancellative families of subsets of an n-set is known, (Tolhuizen [7]). We provide a new upper ...

متن کامل

Classification of monoids by Condition $(PWP_{ssc})$

Condition $(PWP)$ which was introduced in (Laan, V., {it Pullbacks and flatness properties of acts I}, Commun. Algebra, 29(2) (2001), 829-850), is related to flatness concept of acts over monoids. Golchin and Mohammadzadeh in ({it On Condition $(PWP_E)$}, Southeast Asian Bull. Math., 33 (2009), 245-256) introduced Condition $(PWP_E)$, such that Condition $(PWP)$ implies it, that is, Condition $...

متن کامل

Almost all cancellative triple systems are tripartite

A triple system is cancellative if no three of its distinct edges satisfy A ∪ B = A ∪ C. It is tripartite if it has a vertex partition into three parts such that every edge has exactly one point in each part. It is easy to see that every tripartite triple system is cancellative. We prove that almost all cancellative triple systems with vertex set [n] are tripartite. This sharpens a theorem of N...

متن کامل

A New Construction for Cancellative Families of Sets

Following [2], we say a family, H , of subsets of a n-element set is cancellative if A∪B = A∪C implies B = C when A,B,C ∈ H . We show how to construct cancellative families of sets with c2 elements. This improves the previous best bound c2 and falsifies conjectures of Erdös and Katona [3] and Bollobas [1]. AMS Subject Classification. 05C65 We will look at families of subsets of a n-set with the...

متن کامل

Cancellative Residuated Lattices

Cancellative residuated lattices are a natural generalization of lattice-ordered groups (`-groups). Although cancellative monoids are defined by quasi-equations, the class CanRL of cancellative residuated lattices is a variety. We prove that there are only two commutative subvarieties of CanRL that cover the trivial variety, namely the varieties generated by the integers and the negative intege...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013